|
|
Application of recent methods for synthesis of heat exchanger network
Kunc, Vlastimil ; Kohoutek, Josef (referee) ; Jegla, Zdeněk (advisor)
Master’s thesis deals with the problems of heat exchanger network synthesis and compare the present methods with emphasis on Pinch Design Method and deterministic method. Based on theoretical formulation of deterministic model the computer program for heat exchanger network synthesis was developed in the software Maple environment. Developed software implementation of deterministic method has been applied to several case studies.
|
|
|
Communication complexity
Wagner, Vojtěch ; Krajíček, Jan (advisor) ; Koucký, Michal (referee)
Title: Communication Complexity Author: Vojtěch Wagner Department: Department of Algebra Supervisor: prof. RNDr. Jan Krajíček, DrSc. Abstract: This work deals with communication complexity, which considers mo- del of two (or more) parties, each holding its own binary input (let's say x and y). Each of players has information only about his own input. Their common goal is to compute value of some function f(x, y) of these inputs. Communicati- on complexity measures amount of information communicated between players in order to compute f(x, y). This work especially concerns two main models - deterministic, in which all decision made by players is deterministic and they compute the right value in all cases and probabilistic model which allows ran- domized fashion and the goal of the players is to compute the right value with high enough probability. We present some basic concepts and methods to lower bound communication complexity of functions, all ilustrated on some examples of basic functions. In the end we present some complex and practically relevant examples, on which presented methods are demonstrated. Keywords: communication complexity, deterministic communication model, ran- domized model, lower bounds on communication complexity. 1
|
|
|
Communication complexity
Wagner, Vojtěch ; Krajíček, Jan (advisor) ; Koucký, Michal (referee)
Title: Communication Complexity Author: Vojtěch Wagner Department: Department of Algebra Supervisor: prof. RNDr. Jan Krajíček, DrSc. Abstract: This work deals with communication complexity, which considers mo- del of two (or more) parties, each holding its own binary input (let's say x and y). Each of players has information only about his own input. Their common goal is to compute value of some function f(x, y) of these inputs. Communicati- on complexity measures amount of information communicated between players in order to compute f(x, y). This work especially concerns two main models - deterministic, in which all decision made by players is deterministic and they compute the right value in all cases and probabilistic model which allows ran- domized fashion and the goal of the players is to compute the right value with high enough probability. We present some basic concepts and methods to lower bound communication complexity of functions, all ilustrated on some examples of basic functions. In the end we present some complex and practically relevant examples, on which presented methods are demonstrated. Keywords: communication complexity, deterministic communication model, ran- domized model, lower bounds on communication complexity. 1
|
|
|
Application of recent methods for synthesis of heat exchanger network
Kunc, Vlastimil ; Kohoutek, Josef (referee) ; Jegla, Zdeněk (advisor)
Master’s thesis deals with the problems of heat exchanger network synthesis and compare the present methods with emphasis on Pinch Design Method and deterministic method. Based on theoretical formulation of deterministic model the computer program for heat exchanger network synthesis was developed in the software Maple environment. Developed software implementation of deterministic method has been applied to several case studies.
|
|
| |
guest ::
